Automated proof of ring commutativity problems by algebraic methods
نویسندگان
چکیده
منابع مشابه
Z-polynomials and Ring Commutativity
We characterise polynomials f with integer coefficients such that a ring with unity R is necessarily commutative if f(x) is central for all x ∈ R. We also solve the corresponding problem without the assumption that the ring has a unity.
متن کاملAlgebraic Methods for Optimization Problems
We argue for the benefits of relations over functions for modelling programs, and even more so for modelling specifications. To support this argument, we present an extended case study for a class of optimization problems, deriving efficient functional programs from concise relational specifications.
متن کاملA Non-commutativity Statement for Algebraic Quaternions
In this paper we provide a constructive version of Tits alternative for a broad class of quaternions with algebraic coefficients. Our result is a generalization of that contained in the paper [1], concerning groups of rational quaternions. Indeed, the tools developed in [1] can be extended to arbitrary number fields by translating them in the corresponding Dedekind domain, as the techniques inv...
متن کاملUniversal Algebraic Methods for Constraint Satisfaction Problems
After substantial progress over the last 15 years, the “algebraic CSPdichotomy conjecture” reduces to the following: every local constraint satisfaction problem (CSP) associated with a finite idempotent algebra is tractable if and only if the algebra has a Taylor term operation. Despite the tremendous achievements in this area, there remain examples of small algebras with just a single binary o...
متن کاملOn Process-Algebraic Proof Methods for Fault Tolerant Distributed Systems
Distributed Algorithms are hard to prove correct. In settings with process failures, things get worse. Among the proof methods proposed in this context, we focus on process calculi, which offer a tight connection of proof concepts to the actual code representing the algorithm. We use Distributed Consensus as a case study to evaluate recent developments in this field. Along the way, we find that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1990
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(08)80020-x